A Belief-Function Logic
نویسنده
چکیده
We present BFL, a hybrid logic for representing uncertain knowledge. BFL attaches a quantified notion of belief based on Dempster-Shafer’s theory of belief functions to classical first-order logic. The language of BFL is composed of objects of the form F:[a,b], where F is a first-order sentence, and Q and b are numbers in the [O,l] interval (with c&b). Intuitively, a measures the strength of our belief in the truth of F, and (lb) that in its falseness. A number of properties of first-order logic nicely generalize to BFL; in return, BFL gives us a new perspective on some important points of Dempster-Shafer theory (e.g., the role of Dempster’s combination rule).
منابع مشابه
Belief Change in Branching Time: AGM-consistency and Iterated Revision
We study belief change in the branching-time structures introduced in [4]. First, we identify a property of branching-time frames that is equivalent to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision ...
متن کاملPlausibility and Belief Measures Induced by Kripke Models
Modal logic interpretations of plausibility and belief measures are developed based on the observation that the inverse of the value assignment function in a model of modal logic induces the upper plausibility and lower belief measures of the plausibility and belief measures induced by the accessibility relation, regarded as a multivalued mapping.
متن کاملCumulative and Averaging Unfusion of Beliefs
Belief fusion is the principle of combining separate beliefs or bodies of evidence originating from different sources. Depending on the situation to be modelled, different belief fusion methods can be applied. Cumulative and averaging belief fusion is defined for fusing opinions in subjective logic, and for fusing belief functions in general. The principle of unfusion is the opposite of fusion,...
متن کاملRules, Belief Functions and Default Logic
This paper describes a natural framework for rules , based on belief functions , which includes a repre s entation of numerical rules, default rules and rules allowing and rules not allowing contraposition. In particular it justifies the use of th e Dempster-Shafer Th eory for representing a particular class of rules , Belief calculated being a lower probability given cer tain independence as...
متن کاملBisimulation and expressivity for conditional belief, degrees of belief, and safe belief
Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe bel...
متن کامل